t = int(input())
for tidx in range(t):
n, l, r, s = [int(x) for x in input().split()]
if s > n*(n+1)//2 - (n-r+l)*(n-r+l-1)//2 or s < (r-l+1)*(r-l+2)//2:
print(-1)
else:
x = list(range(1, r-l+2))
m = s - sum(x)
for i in range(r-l+1):
j = r-l-i
xjold = x[j]
x[j] = min(n-i, x[j] + m)
m = m - x[j] + xjold
y = list(set(range(1, n+1)).difference(x))
print(*y[:(l-1)], *x, *y[(l-1):])
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int tc; cin >> tc;
while(tc--) {
int n, l, r, s;
cin >> n >> l >> r >> s;
if(s < (r - l + 1) * (r - l + 2) / 2 || s > (r - l + 1) * (2 * n - r + l) / 2) {
cout << "-1\n";
continue;
}
vector <int> ans(n + 1);
int d = (s - (r - l + 1) * (r - l + 2) / 2) / (r - l + 1);
int extra = (s - (r - l + 1) * (r - l + 2) / 2) % (r - l + 1);
set <int> not_used;
for(int i = 1; i <= n; i++) not_used.insert(i);
for(int i = l; i <= r; i++) {
ans[i] = i - l + d + 1;
if(r - extra < i) ans[i]++;
not_used.erase(ans[i]);
}
for(int i = 1; i < l; i++) {
ans[i] = *not_used.begin();
not_used.erase(*not_used.begin());
}
for(int i = r + 1; i <= n; i++) {
ans[i] = *not_used.begin();
not_used.erase(*not_used.begin());
}
for(int i = 1; i <= n; i++) cout << ans[i] << " ";
cout << "\n";
}
return 0;
}
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |